Deterministic automaton

Results: 176



#Item
31Tableaux with Automata (Extended Abstract) Oliver Friedmann and Martin Lange Dept. of Computer Science, University of Munich, Germany 1

Tableaux with Automata (Extended Abstract) Oliver Friedmann and Martin Lange Dept. of Computer Science, University of Munich, Germany 1

Add to Reading List

Source URL: files.oliverfriedmann.de

Language: English - Date: 2012-02-10 07:43:21
32The Monad.Reader Issue 16 by Aran Donohue  and John W. Lato  and Louis Wasserman  May 12, 2010

The Monad.Reader Issue 16 by Aran Donohue and John W. Lato and Louis Wasserman May 12, 2010

Add to Reading List

Source URL: themonadreader.files.wordpress.com

Language: English - Date: 2010-05-12 14:00:40
33Models of Computation  Lecture 4: Nondeterministic Automata [Fa’14] Caveat lector! This is the first edition of this lecture note. Some topics are incomplete, and there are almost certainly a few serious errors. Please

Models of Computation Lecture 4: Nondeterministic Automata [Fa’14] Caveat lector! This is the first edition of this lecture note. Some topics are incomplete, and there are almost certainly a few serious errors. Please

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:05:08
34Models of Computation  Lecture 3: Finite-State Machines [Fa’14] Caveat lector! This is the first edition of this lecture note. A few topics are missing, and there are almost certainly a few serious errors. Please send

Models of Computation Lecture 3: Finite-State Machines [Fa’14] Caveat lector! This is the first edition of this lecture note. A few topics are missing, and there are almost certainly a few serious errors. Please send

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:05:05
35Computing with Relational Machines G´erard Huet and Benoˆıt Razet INRIA Paris-Rocquencourt ICON’2008 Tutorial, Pune, DecemberAbstract. We give a quick presentation of the X-machines of Eilenberg, a generalisa

Computing with Relational Machines G´erard Huet and Benoˆıt Razet INRIA Paris-Rocquencourt ICON’2008 Tutorial, Pune, DecemberAbstract. We give a quick presentation of the X-machines of Eilenberg, a generalisa

Add to Reading List

Source URL: pauillac.inria.fr

Language: English - Date: 2008-12-14 19:37:35
36On system rollback and totalised fields An algebraic approach to system change Mark Burgess and Alva Couch 20th June 2011 This paper is dedicated to Jan Bergstra on the occasion of his 60th birthday.

On system rollback and totalised fields An algebraic approach to system change Mark Burgess and Alva Couch 20th June 2011 This paper is dedicated to Jan Bergstra on the occasion of his 60th birthday.

Add to Reading List

Source URL: markburgess.org

Language: English - Date: 2014-12-18 08:35:34
37Capacity and Expressiveness of Genomic Tandem Duplication Siddharth Jain Farzad Farnoud (Hassanzadeh)

Capacity and Expressiveness of Genomic Tandem Duplication Siddharth Jain Farzad Farnoud (Hassanzadeh)

Add to Reading List

Source URL: www.paradise.caltech.edu

Language: English - Date: 2015-02-26 18:45:52
38Efficient Inclusion Testing for Simple Classes of Unambiguous ω-Automata Dimitri Isaaka , Christof L¨odinga a Informatik  7, RWTH Aachen, Germany

Efficient Inclusion Testing for Simple Classes of Unambiguous ω-Automata Dimitri Isaaka , Christof L¨odinga a Informatik 7, RWTH Aachen, Germany

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2012-05-29 11:02:30
39languages of infinite traces and deterministic asynchronous automata Namit Chaturvedi November 06, 2013

languages of infinite traces and deterministic asynchronous automata Namit Chaturvedi November 06, 2013

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2013-11-18 06:29:48
40Automated Grading of DFA Constructions ∗ Rajeev Alur and Loris D’Antoni Sumit Gulwani Dileep Kini and Mahesh Viswanathan Department of Computer Science Microsoft Research Department of Computer Science

Automated Grading of DFA Constructions ∗ Rajeev Alur and Loris D’Antoni Sumit Gulwani Dileep Kini and Mahesh Viswanathan Department of Computer Science Microsoft Research Department of Computer Science

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2013-04-24 11:35:08